package leetcode;

public class _100 {
    /**
     * 相同的树
     */
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if(p==null||q ==null){
                return p==q;
            }
            return q.val == p.val&&isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
        }
    }
}
